Topological consistency preservation with graph transformation schemes
نویسندگان
چکیده
Topology-based geometric modeling tackles the issue of representing objects with data structures that encode topological subdivision modeled in vertices, edges, faces, and volumes. Such subdivisions can be represented graphs labeled by dimensions on arcs, while operations used to edit formalized as graph transformations. Among existing models, we consider generalized oriented maps, defined constrained graphs, ensure well-formedness objects. Since a operation should provide correct object when applied object, transformations are provided conditions model consistency. Our approach exploits firmly established framework DPO implement operations. We enrich standard product construction ease design, enabling generic rule schemes. lift from rules this enriched framework, ensuring preservation consistency via static analysis syntactic • Double-pushout modeling. Unified for maps. Consistency analysis. Generalization using functors categorical products.
منابع مشابه
Distance-Based Topological Indices and Double graph
Let $G$ be a connected graph, and let $D[G]$ denote the double graph of $G$. In this paper, we first derive closed-form formulas for different distance based topological indices for $D[G]$ in terms of that of $G$. Finally, as illustration examples, for several special kind of graphs, such as, the complete graph, the path, the cycle, etc., the explicit formulas for some distance based topologica...
متن کاملGraph Transformation with Variables
Variables make rule-based systems more abstract and expressive, as witnessed by term rewriting systems and two-level grammars. In this paper we show that variables can be used to define advanced ways of graph transformation as well. Taking the gluing approach to graph transformation [7, 3] as a basis, we consider extensions of rules with attribute variables, clone variables, and graph variables...
متن کاملGraph Transformation with Incremental Updates
We propose an efficient implementation technique for graph transformation systems based on incremental updates. The essence of the technique is to keep track of all possible matchings of graph transformation rules in database tables, and update these tables incrementally to exploit the fact that rules typically perform only local modifications to models.
متن کاملStochastic Graph Transformation with Regions
Graph transformation can be used to implement stochastic simulation of dynamic systems based on semi-Markov processes, extending the standard approach based on Markov chains. The result is a discrete event system, where states are graphs, and events are rule matches associated to general distributions, rather than just exponential ones. We present an extension of this model, by introducing a hi...
متن کاملLearning to Rank with Graph Consistency
The ranking models of existing image search engines are generally based on associated text while the image visual content is actually neglected. Imperfect search results frequently appear due to the mismatch between the textual features and the actual image content. Visual reranking, in which visual information is applied to refine text based search results, has been proven to be effective. How...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science of Computer Programming
سال: 2022
ISSN: ['1872-7964', '0167-6423']
DOI: https://doi.org/10.1016/j.scico.2021.102728